Coalition structure generation with worst case guarantees
نویسندگان
چکیده
منابع مشابه
Coalition Structure Generation with Worst Case Guarantees
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. Furthermore, nding the optimal coalition structure is NP-complete. But then, can the coalition structure found via a partial search be guara...
متن کاملCoalition structure generation with worst case
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. Furthermore, finding the optimal coalition structure is NP-complete. But then, can the coalition structure found via a partial search be gua...
متن کاملWorst-Case-Optimal Anytime Coalition Structure Generation
Coalition formation is one of the key problems in multiagent systems. One would prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. This paper focuses on nding a worst case bound on how good the optimal coalition structure is compared to the best coalition s...
متن کاملMinimum Search to Establish Worst-Case Guarantees in Coalition Structure Generation
Coalition formation is a fundamental research topic in multi-agent systems. In this context, while it is desirable to generate a coalition structure that maximizes the sum of the values of the coalitions, the space of possible solutions is often too large to allow exhaustive search. Thus, a fundamental open question in this area is the following: Can we search through only a subset of coalition...
متن کاملOnline checkpointing with improved worst-case guarantees
In the online checkpointing problem, the task is to continuously maintain a set of k checkpoints that allow to rewind an ongoing computation faster than by a full restart. The only operation allowed is to replace an old checkpoint by the current state. Our aim are checkpoint placement strategies that minimize rewinding cost, i.e., such that at all times T when requested to rewind to some time t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1999
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(99)00036-3